Generically rational polynomials of quasi-simple type
نویسندگان
چکیده
منابع مشابه
Rational Polynomials of Simple Type
A polynomial map f : C2 → C is rational if its generic fibre, and hence every fibre, is of genus zero. It is of simple type if, when extended to a morphism f̃ : X → P1 of a compactification X of C2, the restriction of f̃ to each curve C of the compactification divisor D = X − C2 is either degree 0 or 1. The curves C on which f̃ is non-constant are called horizontal curves, so one says briefly “eac...
متن کاملReal Rational Surfaces Are Quasi - Simple
We show that real rational (over C) surfaces are quasi-simple, i.e., that such a surface is determined up to deformation in the class of real surfaces by the topological type of its real structure.
متن کاملCoefficient functions of the Ehrhart quasi-polynomials of rational polygons
In 1976, P. R. Scott characterized the Ehrhart polynomials of convex integral polygons. We study the same question for Ehrhart polynomials and quasi-polynomials of nonintegral convex polygons. Define a pseudo-integral polygon, or PIP, to be a convex rational polygon whose Ehrhart quasipolynomial is a polynomial. The numbers of lattice points on the interior and on the boundary of a PIP determin...
متن کاملPresburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be represented by rational generating functions; a geometric characterization of such sets is also given. In addition, if p = (p1, . . . , pn) are a subset of the free...
متن کاملInferring Type Isomorphisms Generically
Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary products. In some canonical cases, the conversion function is uniquely determined solely by the two types involved. In this article we describe and implement a program in Generic Haskell which automatically infers this function by n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2006
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2005.11.038